/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86183
 * Date: 2024-05-20
 * Time: 10:56
 */
public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
       BinaryTree.TreeNode root = binaryTree.createTree();
        System.out.println("前序遍历:");
       binaryTree.preOrder(root);
        System.out.println();
        System.out.println("中序遍历:");
        binaryTree.inOrder(root);
        System.out.println();
        System.out.println("后序遍历:");
        binaryTree.postOrder(root);
        System.out.println();
        System.out.println("节点个数:");
        System.out.println(binaryTree.size2(root));
        System.out.println("叶子节点个数:");
//        binaryTree.getLeafNodeCount1(root);
//        System.out.println(BinaryTree.leafSize);
        System.out.println(binaryTree.getLeafNodeCount2(root));
        System.out.println("树的高度:");
        System.out.println(binaryTree.getHeight(root));
//  BinaryTree.TreeNode node = binaryTree.find(root , 'H');
//        System.out.println(node.val);
        binaryTree.levelOrder(root);
        System.out.println();
        System.out.println(binaryTree.isCompleteTree(root));

    }
}
